A Revised Algorithms for Deadlock Detection and Resolution in Mobile Agent Systems

A study on Deadlock detection is being done for many years. Not much work has been done on Deadlock resolution. Wait –for model approach followed to avoid deadlocks offers incorrectness to many algorithms after deadlocks have been resolved. In this paper, a theoretical framework for wait-for systems is provided, and general characteristics of a correct algorithm for deadlock detection and resolution are presented. It is shown that the computational upper bounds(number of messages) for deadlock detection and resolution are both O(n3) in the worst case when n transactions are involved. This result is better than previous ones, which often are even exponential. In addition, two correct deadlock detection and resolution algorithms are described which both achieve these upper bounds.